Research on nonepermeable packing materials (II)

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Egerváry Research Group on Combinatorial Optimization Packing Arborescences Packing Arborescences

In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of several subsequent extensions. Recently, Japanese researchers found an unexpected further generalization which gave rise to many interesting questions about this subject [29], [20]. Another line of researches focused on covering intersecting families which generalizes Edmonds' theorems in a di eren...

متن کامل

Packing of compressible granular materials

3D computer simulations and experiments are employed to study random packings of compressible spherical grains under external confining stress. In the rigid ball limit, we find a continuous transition in which the stress vanishes as (straight phi-straight phi(c))(beta), where straight phi is the (solid phase) volume density. The value of straight phi(c) depends on whether the grains interact vi...

متن کامل

Two-dimensional packing in prolate granular materials.

We investigate the two-dimensional packing of extremely prolate (aspect ratio alpha=L/D>10) granular materials, comparing experiments with Monte Carlo simulations. The average packing fraction of particles with aspect ratio alpha=12 is 0.68+/-0.03. We quantify the orientational correlation of particles and find a correlation length of two particle lengths. The functional form of the orientation...

متن کامل

Packing cycles in graphs, II

A graph G packs if for every induced subgraph H of G, the maximum number of vertexdisjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack.

متن کامل

On Open Packing Number of Graphs

In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sen'i Gakkaishi

سال: 1947

ISSN: 0037-9875,1884-2259

DOI: 10.2115/fiber.3.5_158